Using convex hulls to extract interaction interfaces from known structures

Using convex hulls to extract interaction interfaces from known structures

MOTIVATION Protein interactions provide an important context for the understanding of function. Experimental approaches have been complemented with computational ones, such as PSIMAP, which computes domain-domain interactions for all multi-domain and multi-chain proteins in the Protein Data Bank (PDB). PSIMAP has been used to determine that superfamilies occurring in many species have many inte...

From Binary to Grey Scale Convex Hulls

Constructing Strongly Convex Hulls Using Exact or

One useful generalization of the convex hull of a set S of n points is the-strongly convex-hull. It is deened to be a convex polygon P with vertices taken from S such that no point in S lies farther than outside P and such that even if the vertices of P are perturbed by as much as , P remains convex. It was an open question 1 as to whether an-strongly convex O()-hull existed for all positive. W...

View Synthesis using Convex and Visual Hulls

This paper discusses two efficient methods for image based rendering. Both algorithms approximate the world object. One uses the convex hull and the other uses the visual hull. We show that the overhead of using the latter is not always justified and in some cases, might even hurt. We demonstrate the method on real images from a studio-like setting in which many cameras are used, after a simple...

Computing Convex Hulls Using Smart Pixels

We consider a problem domain consisting of a quadratic grid of n “smart pixels” which observe a black-andwhite image. Each of these smart pixels can communicate with its direct neighbors and perform simple computations. Contiguous groups of black pixels form objects on the grid. We present a deterministic algorithm to compute the convex hulls of all objects on the pixel grid simultaneously in t...